Probabilistic forecasting for geosteering in fluvial successions using a generative adversarial network

نویسندگان

چکیده

Quantitative workflows utilizing real-time data to constrain uncertainty have the potential significantly improve geosteering. Fast updates based on are particularly important when drilling in complex reservoirs with high uncertainties pre-drill models. However, practical assimilation of requires effective geological modelling and mathematically robust parameterization. We propose a generative adversarial deep neural network (GAN), which is trained reproduce geologically consistent 2D sections fluvial successions. Offline training produces fast GAN-based approximation geology parameterized as 60-dimensional model vector standard Gaussian distribution each component. Probabilistic forecasts generated using an ensemble equiprobable realizations. A forward-modelling sequence, including GAN, converts initial (prior) realizations into EM log predictions. An smoother minimizes statistical misfits between predictions data, yielding update vectors reduced around well. Updates can then be translated probabilistic facies resistivities. This paper demonstrates workflow for geosteering outcrop-based synthetic succession.In our example, method reduces correctly predicts most major features up 500 m ahead drill-bit.The condensed summary also submitted presentation at 3rd EAGE/SPE Geosteering Workshop held 2–4 November 2021, online.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Generative Adversarial Networks

We introduce the Probabilistic Generative Adversarial Network (PGAN), a new GAN variant based on a new kind of objective function. The central idea is to integrate a probabilistic model (a Gaussian Mixture Model, in our case) into the GAN framework which supports a new kind of loss function (based on likelihood rather than classification loss), and at the same time gives a meaningful measure of...

متن کامل

Wasserstein Generative Adversarial Network

Recent advances in deep generative models give us new perspective on modeling highdimensional, nonlinear data distributions. Especially the GAN training can successfully produce sharp, realistic images. However, GAN sidesteps the use of traditional maximum likelihood learning and instead adopts an two-player game approach. This new training behaves very differently compared to ML learning. Ther...

متن کامل

Controllable Generative Adversarial Network

Although it is recently introduced, in last few years, generative adversarial network (GAN) has been shown many promising results to generate realistic samples. However, it is hardly able to control generated samples since input variables for a generator are from a random distribution. Some attempts have been made to control generated samples from GAN, but they have shown moderate results. Furt...

متن کامل

Automatic Colorization of Grayscale Images Using Generative Adversarial Networks

Automatic colorization of gray scale images poses a unique challenge in Information Retrieval. The goal of this field is to colorize images which have lost some color channels (such as the RGB channels or the AB channels in the LAB color space) while only having the brightness channel available, which is usually the case in a vast array of old photos and portraits. Having the ability to coloriz...

متن کامل

GANGs: Generative Adversarial Network Games

Generative Adversarial Networks (GAN) have become one of the most successful frameworks for unsupervised generative modeling. As GANs are difficult to train much research has focused on this. However, very little of this research has directly exploited gametheoretic techniques.We introduce Generative Adversarial Network Games (GANGs), which explicitly model a finite zero-sum game between a gene...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: First Break

سال: 2021

ISSN: ['0263-5046', '1365-2397']

DOI: https://doi.org/10.3997/1365-2397.fb2021051